Constraint Programming H El Ene Fargier
نویسندگان
چکیده
There has been a lot of interest lately from people solving constrained optimization problems for Constraint Programming (CP). Constraint programming cannot be described as a technique by itself but perhaps better as a class of computer languages tailored to the expression and resolution of problems which are non-deterministic in nature, with a fast program development and eecient runtime performances. Constraint programming derives from logic programming, operational research and artiicial intelligence. Logic programming ooers the general non-deterministic host language which accommodates dedicated constraint solvers from OR and AI such as linear programming or constraint satisfaction techniques. In this paper, we rst review how pure logic programming languages evolved into Constraint Logic Programming (CLP) languages, bringing to light the interface between logic programming and constraint solvers. Some extra attention is given to a speciic class of constraint solving techniques which have been developed in the Constraint Satisfaction Problem framework and which are currently used in most CLP languages to solve constrained problems in nite domains. We nally conclude by an overview of some existing CP languages, with some examples taken from scheduling.
منابع مشابه
A constraint satisfaction framework for decision under uncertainty
The Constraint Satisfaction Problem (CSP) framework offers a simple and sound basis for representing and solving simple decision problems, without uncertainty. This paper is devoted to an extension of the CSP framework enabling us to deal with some decisions problems under uncertainty. This extension relies on a differentiation between the agent-controllable decision variables and the uncontrol...
متن کاملLexicographic Refinements in Possibilistic Decision Trees
Possibilistic decision theory has been proposed twenty years ago and has had several extensions since then. Because of the lack of decision power of possibilistic decision theory, several refinements have then been proposed. Unfortunately, these refinements do not allow to circumvent the difficulty when the decision problem is sequential. In this article, we propose to extend lexicographic refi...
متن کاملMaintaining Alternative Values in Constraint-based Configuration
Constraint programming techniques are widely used to model and solve interactive decision problems, and especially configuration problems. In this type of application, the configurable product is described by means of a set of constraints bearing on the configuration variables. The user interactively solves the CSP by assigning the variables according to her preferences. The system then has to ...
متن کاملComparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کامل